منابع مشابه
One-in-Two-Matching Problem is NP-complete
2-dimensional Matching Problem, which requires to find a matching of leftto rightvertices in a balanced 2n-vertex bipartite graph, is a well-known polynomial problem, while various variants, like the 3-dimensional analogoue (3DM, with triangles on a tripartite graph), or the Hamiltonian Circuit Problem (HC, a restriction to “unicyclic” matchings) are among the main examples of NP-hard problems,...
متن کاملAn Average Case NP-complete Graph Problem
NP-complete problems should be hard on some instances but these may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on average unless all NP problem under any samplable (i.e. generateable in polynomial time) distribution a...
متن کاملSystem Design Is an NP-Complete Problem
The system design process translates the customers’ needs into a buildable system design. It requires selecting subsystems from an allowable set and matching the interfaces between them. Designs that meet the top-level input and output requirements are tested to see how well they meet the system’s performance and cost goals. This paper proves that the System Design Problem is NP-complete by red...
متن کاملAn NP-Complete Problem in Grid Coloring
A c-coloring of Gn,m = [n] × [m] is a mapping of Gn,m into [c] such that no four corners forming a rectangle have the same color. In 2009 a challenge was proposed via the internet to find a 4-coloring of G17,17. This attracted considerable attention from the popular mathematics community. A coloring was produced; however, finding it proved to be difficult. The question arises: is the problem of...
متن کاملNP-Complete Stable Matching Problems
This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are two special cases of the matching problems known as stable matching. The roommate problem is that of assigning a set of people to rooms of exactly two occupants in accordance with the preferences of the members of the set. The intern assignment problem with couples is that o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1980
ISSN: 0166-218X
DOI: 10.1016/0166-218x(80)90055-4